Interest clustering coefficient: a new metric for directed networks like Twitter
نویسندگان
چکیده
Abstract The clustering coefficient has been introduced to capture the social phenomena that a friend of tends be my friend. This metric widely studied and shown great interest describe characteristics graph. But, is originally defined for graph in which links are undirected, such as friendship (Facebook) or professional (LinkedIn). For directed from source information consumer information, it no more adequate. We show former studies have missed much contained part graphs. In this article, we introduce new measure graphs with links, namely coefficient. compute (exactly using sampling methods) on very large graph, Twitter snapshot 505 million users 23 billion well other various datasets. additionally provide values formerly undirected metrics, first snapshot. observe higher value than classic coefficients, showing importance metric. By studying bidirectional edges also adequate while ones part. model able build random networks high finally discuss link recommendation.
منابع مشابه
Temporal correlation coefficient for directed networks
Previous studies dealing with network theory focused mainly on the static aggregation of edges over specific time window lengths. Thus, most of the dynamic information gets lost. To assess the quality of such a static aggregation the temporal correlation coefficient can be calculated. It measures the overall possibility for an edge to persist between two consecutive snapshots. Up to now, this m...
متن کاملA New Method for Clustering Wireless Sensor Networks to Improve the Energy Consumption
Clustering is an effective approach for managing nodes in Wireless Sensor Network (WSN). A new method of clustering mechanism with using Binary Gravitational Search Algorithm (BGSA) in WSN, is proposed in this paper to improve the energy consumption of the sensor nodes. Reducing the energy consumption of sensors in WSNs is the objective of this paper that is through selecting the sub optimum se...
متن کاملDirected clustering in weighted networks: a new perspective
In this paper, we consider the problem of assessing local clustering in complex networks. Various definitions for this measure have been proposed for the cases of networks having weighted edges, but less attention has been paid to both weighted and directed networks. We provide a new local clustering coefficient for this kind of networks, starting from those existing in the literature for the w...
متن کاملInterest communities and flow roles in directed networks: the Twitter network of the UK riots
Directionality is a crucial ingredient in many complex networks in which information, energy or influence are transmitted. In such directed networks, analysing flows (and not only the strength of connections) is crucial to reveal important features of the network that might go undetected if the orientation of connections is ignored. We showcase here a flow-based approach for community detection...
متن کاملLayerwidth: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain problems of structural model-based causality and explanation to be tractably solved. In this paper, we first address an open question raised by Eiter and Lukasiewicz – the computational complexity of deciding whether a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2021
ISSN: ['2051-1310', '2051-1329']
DOI: https://doi.org/10.1093/comnet/cnab030